FAMCS: Finding All Maximal Common Substructures in Proteins

نویسندگان

  • Zhen Yao
  • Juan Xiao
  • Anthony K.H. Tung
  • Wing Kin Sung
چکیده

Finding the common substructures shared by two proteins is considered as one of the central issues in computational biology because of its usefulness in understanding the structure-function relationship and application in drug and vaccine design. In this paper, we propose a novel algorithm called FAMCS (Finding All Maximal Common Substructures) for the common substructure identification problem. Our method works initially at the protein secondary structural element (SSE) level and starts with the identification of all structurally similar SSE pairs. These SSE pairs are then merged into sets using a modified Apriori algorithm, which will test the similarity of various sets of SSE pairs incrementally until all the maximal sets of SSE pairs that deemed to be similar are found. The maximal common substructures of the two proteins will be formed from these maximal sets. A refinement algorithm is also proposed to fine tune the alignment from the SSE level to the residue level. Comparison of FAMCS with other methods on various proteins shows that FAMCS can address all four requirements and infer interesting biological discoveries.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Proximal Point Algorithm for Finding a Common Zero of a Finite Family of Maximal Monotone Operators

In this paper, we consider a proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in real Hilbert spaces. Also, we give a necessary and sufficient condition for the common zero set of finite operators to be nonempty, and by showing that in this case, this iterative sequence converges strongly to the metric projection of some point onto the set of c...

متن کامل

Detection of Distant Structural Similarities in a Set of Proteins Using a Fast Graph-Based Method

We introduce a method for finding weak structural similarities in a set of protein structures. Proteins are considered at their secondary structure level. The method uses a rigorous graph-theoretical algorithm which finds all structural similarities. Protein structures are modelled as undirected labelled graphs, the so-called protein graphs. We suggest that for detecting the similarities betwee...

متن کامل

The Study of Substructures of Addiction Phenomena in High School Students Using Problem Finding Workshops

Background: Addiction is one of the complicated problems in Iranian young population. The social and cultural dimensions of this social disease are less considered. So considering socio-cultural and environmental resources, this study investigated the substructures of addiction according to the viewpoints of high-school students of Kerman in 2007-2008.Methods: This qualitative study accomplishe...

متن کامل

Conserved key amino acid positions (CKAAPs) derived from the analysis of common substructures in proteins.

An all-against-all protein structure comparison using the Combinatorial Extension (CE) algorithm applied to a representative set of PDB structures revealed a gallery of common substructures in proteins (http://cl.sdsc.edu/ce.html). These substructures represent commonly identified folds, domains, or components thereof. Most of the subsequences forming these similar substructures have no signifi...

متن کامل

Anticonvulsive Effect of Seed Extract of Caesalpinia bonducella (Roxb.)

In traditional system of Indian medicine, C.bonducella is widely used for its antipyretic, antiperiodic, anticonvulsive, and antiparalytic activities. For assessing anticonvulsant activity, pentylenetetrazole, maximal electro shock, strychnine- and picrotoxin-induced convulsions models were used. Diazepam was used as a standard reference for all models except maximal electro shock model, wh...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره 3  شماره 

صفحات  -

تاریخ انتشار 2005